<TITLE>prob018: water bucket problem</TITLE>
<HR><!------------------------------------------------------------------------>
<CENTER>
<H1>prob018: water bucket problem</H1>

<TABLE>
<TR> <TD> proposed by
     <TD ALIGN=LEFT> <A HREF="http://www.cs.york.ac.uk/~tw">
          <B>Toby Walsh</B></A> 
          <ADDRESS><a href="mailto:tw@cs.york.ac.uk">
          tw@cs.york.ac.uk</a></ADDRESS>
</TABLE>
</CENTER>
<HR><!------------------------------------------------------------------------>
<H3> References </H3>

The problem appeared in the <i>Sunday Telegraph</i> newspaper
on 2nd September 1999, in an article by 
Robert Matthews, <A HREF="http://www.telegraph.co.uk:80/et?ac=000112753058119&rtmo=LihilyKd&atmo=99999999&pg=/et/99/9/2/ecfmaze02.html">Labyrinthine theories to stop us getting lost</A>.


<P>
Peter van Beek and Xinguang Chen have shown that constraint satisfaction
can be a viable approach to solve planning problems. They distribute
<A HREF="ftp://ftp.cs.ualberta.ca/pub/vanbeek/software/cplan.tar.gz">CPlan</B></A>,
a C program for solving planning problems (see the
<A HREF="ftp://ftp.cs.ualberta.ca/pub/vanbeek/software/README.cplan">README</A> file for more details).

<P>
Encoding planning problems into propositional satisfiability
has also been highly popular in the last few years. See,
for example, Henry Kautz's 
<A HREF="http://www.research.att.com/~kautz/blackbox/index.html">Blackbox</A>
system. 

<P>



<HR><!------------------------------------------------------------------------>

<UL>

 <A HREF="../../index.html"> Back</A> to CSPLib home page.


